Abstraction, Reformulation, and Approximation: 4th International Symposium, SARA 2000 Horseshoe Bay, USA, July 26–29, 2000 Proceedings
Author: Berthe Y. Choueiry, Toby Walsh
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-67839-7
DOI: 10.1007/3-540-44914-0
Table of Contents:
- Partial Completeness of Abstract Fixpoint Checking
- An Overview of MAXQ Hierarchical Reinforcement Learning
- Recent Progress in the Design and Analysis of Admissible Heuristic Functions
- GIS Databases: From Multiscale to MultiRepresentation
- An Abstraction Framework for Soft Constraints and Its Relationship with Constraint Propagation
- Abstractions for Knowledge Organization of Relational Descriptions
- Grid-Based Histogram Arithmetic for the Probabilistic Analysis of Functions
- Approximating Data in Constraint Databases
- Linearly Bounded Reformulations of Unary Databases
- A CSP Abstraction Framework
- Interactions of Abstractions in Programming
- Reformulation and Approximation in Model Checking
- The Lumberjack Algorithm for Learning Linked Decision Forests
- Reformulating Propositional Satisfiability as Constraint Satisfaction
- Improving the Efficiency of Reasoning Through Structure-Based Reformulation
- Using Feature Hierarchies in Bayesian Network Learning
- On Reformulating Planning as Dynamic Constraint Satisfaction
- Experiments with Automatically Created Memory-Based Heuristics
- Abstraction and Phase Transitions in Relational Learning
- An Agent-Based Approach to Robust Switching Between Abstraction Levels for Fault Diagnosis
Includes bibliographical references and index